Approximate polytope ensemble for one-class classification
نویسندگان
چکیده
منابع مشابه
Approximate polytope ensemble for one-class classification
In this work, a new one-class classification ensemble strategy called approximate polytope ensemble is presented. The main contribution of the paper is threefold. First, the geometrical concept of convex hull is used to define the boundary of the target class defining the problem. Expansions and contractions of this geometrical structure are introduced in order to avoid over-fitting. Second, th...
متن کاملOne-class kernel subspace ensemble for medical image classification
Classification of medical images is an important issue in computer-assisted diagnosis. In this paper, a classification scheme based on a one-class kernel principle component analysis (KPCA) model ensemble has been proposed for the classification of medical images. The ensemble consists of one-class KPCA models trained using different image features from each image class, and a proposed product ...
متن کاملA Research on Ensembles Method for One Class Classification Using Convex Hull Polytope Model
Classification is a data mining task that allocated similar data to categories or classes. One of the most general methods for classification is ensemble method which refers supervised learning. After generating classification rules we can apply those rules on unidentified data and achieve the results. In oneclass classification it is supposed that only information of one of the classes, the ta...
متن کاملADABOOST ENSEMBLE ALGORITHMS FOR BREAST CANCER CLASSIFICATION
With an advance in technologies, different tumor features have been collected for Breast Cancer (BC) diagnosis, processing of dealing with large data set suffers some challenges which include high storage capacity and time require for accessing and processing. The objective of this paper is to classify BC based on the extracted tumor features. To extract useful information and diagnose the tumo...
متن کاملOptimal Approximate Polytope Membership
In the polytope membership problem, a convex polytope K in R is given, and the objective is to preprocess K into a data structure so that, given a query point q ∈ R, it is possible to determine efficiently whether q ∈ K. We consider this problem in an approximate setting and assume that d is a constant. Given an approximation parameter ε > 0, the query can be answered either way if the distance...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2014
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2013.08.007